منابع مشابه
Automata over continuous time
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of nite memory retrospective functions is the set of functions realized by /nite state devices. We show that the /nite memory retrospective functions are speed-independent, i.e., they are invariant under ‘stretchings’ of the time axi...
متن کاملContinuous-Time Probabilistic KLAIM
The design of languages supporting network programming is a necessary step towards the formalisation of distributed and mobile computing. The existence of an abstract semantic framework constitutes the basis for a formal analysis of such systems. The KLAIM paradigm [5] provides such a semantic framework by introducing basic concepts and primitives addressing the key aspects of the coordination ...
متن کاملProbabilistic Timed I/O Automata with Continuous State Spaces
We present Piecewise Deterministic Timed I/O Automata (PDTIOA): a new continuous state automaton model that allows both nondeterministic and probabilistic discrete transitions, along with continuous deterministic trajectories. We use a partition of actions, called tasks and a task scheduler to resolve nondeterministic choice over actions. We define a topology on the set of trajectories and make...
متن کاملModel-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL∗). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the modelchecking of probabilistic finite automata against branching-time tempor...
متن کاملVerifying Quantitative Properties of Continuous Probabilistic Timed Automata
We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in [19], an extension of the timed automata model of [4], with clock resets made according to continuous probability distributions. Thus, our model exhibits nondeterministic and probabilistic choice, the latter being made accordin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1969
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(69)90468-9